Duality in nondifferentiable minimax fractional programming with B-(p, r)-invexity
نویسندگان
چکیده
* Correspondence: drizhar@kfupm. edu.sa Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia Full list of author information is available at the end of the article Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under B-(p, r)-invexity assumptions. Examples are given to show that B-(p, r)-invex functions are generalization of (p, r)-invex and convex functions AMS Subject Classification: 90C32; 90C46; 49J35.
منابع مشابه
Sufficiency and Duality in Minimax Fractional Programming with Generalized (φ, Ρ)-invexity
Amongst various important applications, one important application of nonlinear programming is to maximize or minimize the ratio of two functions, commonly called fractional programming. The characteristics of fractional programming problems have been investigated widely [1, 6, 10] and [13]. In noneconomic situations, fractional programming problems arisen in information theory, stochastic progr...
متن کاملGeneralized Minimax Programming with Nondifferentiable (G, β)-Invexity
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P). With G-necessary optimality conditions and (G, β)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These...
متن کاملDuality for Minimax Fractional Programming Problems under Second Order (φ, Ρ)-invexity
In the present paper, we are concerned with a minimax fractional programming problem containing arbitrary norms and establish duality theorems for a dual model related to minimax fractional programming problem under the assumptions of second order (Φ, ρ)-invexity.
متن کاملSecond-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
*Correspondence: [email protected] Department of Mathematics, University of Tabuk, Tabuk, Kingdom of Saudi Arabia Abstract In the present paper, we are concerned with second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type assumptions. The weak, strong and converse duality theorems are proved. Results obtained in this paper ext...
متن کاملOptimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity1
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.
متن کامل